Social tag relevance learning via ranking-oriented neighbor voting
نویسندگان
چکیده
منابع مشابه
Tag Relevance for Social Image Retrieval in Accordance with Neighbor Voting Algorithm
Social image retrieval is important for exploiting the increasing amounts of amateur-tagged multimedia such as Flickr images. Intuitively, if different persons label similar images using the same tags, these tags are likely to reflect objective aspects of the visual content. Interpreting the relevance of a user-contributed tag with respect to the visual content of an image is an emerging proble...
متن کاملLearning Ranking Function via Relevance Propagation
In this paper, we propose a novel ranking function learning framework based on relevance propagation. The propagation process is used to propagate the relevance scores from labeled documents to other unlabeled ones so that more training data are available to learn the ranking function. It is realized by the manifold ranking algorithm, which has been proved to be very effective in content-based ...
متن کاملImproving image annotation via ranking-oriented neighbor search and learning-based keyword propagation
Automatic image annotation plays a critical role in modern keyword-based image retrieval systems. For this task, the nearest-neighbor–based scheme works in two phases: first, it finds the most similar neighbors of a new image from the set of labeled images; then, it propagates the keywords associated with the neighbors to the new image. In this article, we propose a novel approach for image ann...
متن کاملFuzzy Neighbor Voting for Automatic Image Annotation
With quick development of digital images and the availability of imaging tools, massive amounts of images are created. Therefore, efficient management and suitable retrieval, especially by computers, is one of themost challenging fields in image processing. Automatic image annotation (AIA) or refers to attaching words, keywords or comments to an image or to a selected part of it. In this paper,...
متن کاملGreedy Multiple Instance Learning via Codebook Learning and Nearest Neighbor Voting
Multiple instance learning (MIL) has attracted great attention recently in machine learning community. However, most MIL algorithms are very slow and cannot be applied to large datasets. In this paper, we propose a greedy strategy to speed up the multiple instance learning process. Our contribution is two fold. First, we propose a density ratio model, and show that maximizing a density ratio fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multimedia Tools and Applications
سال: 2016
ISSN: 1380-7501,1573-7721
DOI: 10.1007/s11042-016-3512-1